Computation in SCMFSA

(1) ICSCMFSA / ∈ Int-Locations . (2) ICSCMFSA / ∈ FinSeq-Locations . (3) Let i be an instruction of SCMFSA and I be an instruction of SCM. Suppose i = I. Let s be a state of SCMFSA and S be a state of SCM. Suppose S = s the carrier of SCM+·((the instruction locations of SCM) 7−→ I). Then Exec(i,s) = s+·Exec(I,S)+·s the instruction locations of SCMFSA. (4) Let s1, s2 be states of SCMFSA. Suppose s1 (Int-Locations∪FinSeq-Locations∪{ICSCMFSA})= s2 (Int-Locations∪FinSeq-Locations∪{ICSCMFSA}). Let l be an instruction of SCMFSA. Then Exec(l,s1) (Int-Locations∪FinSeq-Locations∪{ICSCMFSA})= Exec(l,s2) (Int-Locations∪FinSeq-Locations∪{ICSCMFSA}). (5) Let N be a set with non empty elements, S be a steady-programmed non empty non void AMI over N, i be an instruction of S, and s be a state of S. Then Exec(i,s) the instruction locations of S = s the instruction locations of S.